Orthogonal cartograms with at most 12 corners per face
نویسندگان
چکیده
منابع مشابه
Orthogonal Cartograms with Few Corners Per Face
We give an algorithm to create orthogonal drawings of 3-connected 3-regular planar graphs such that each interior face of the graph is drawn with a prescribed area. This algorithm produces a drawing with at most 12 corners per face and 4 bends per edge, which improves the previous known result of 34 corners per face. ∗Research supported by NSERC. †Cheriton School of Computer Science, University...
متن کاملOn topological graphs with at most four crossings per edge
We show that if a graph G with n ≥ 3 vertices can be drawn in the plane such that each of its edges is involved in at most four crossings, then G has at most 6n− 12 edges. This settles a conjecture of Pach, Radoičić, Tardos, and Tóth. As a corollary we also obtain a better bound for the Crossing Lemma which gives a lower bound for the minimum number of crossings in a drawing of a graph.
متن کاملSeeing Around Corners: Fast Orthogonal Connector Routing
Orthogonal connectors are used in drawings of many types of network diagrams, especially those representing electrical circuits. One approach for routing such connectors has been to compute an orthogonal visibility graph formed by intersecting vertical and horizontal lines projected from the corners of all obstacles and then use an A* search over this graph. However the search can be slow since...
متن کاملOrthogonal 3D-SLAM for Indoor Environments Using Right Angle Corners
Soon, in many service robotic applications, a realtime localization and 3D-mapping capability will be necessary for autonomous navigation. Toward a light and practical SLAM algorithm for indoor scenarios, we propose a fast SLAM algorithm which benefits from sensor geometry for feature extraction and enhance the mapping process using dominant orthogonality in the engineered structures of man-mad...
متن کاملOrthogonal Layout with Optimal Face Complexity
We study a problem motivated by rectilinear schematization of geographic maps. Given a biconnected plane graph G and an integer k ≥ 0, does G have a strictorthogonal drawing (i.e., an orthogonal drawing without edge bends) with at most k reflex angles per face? For k = 0, the problem is equivalent to realizing each face as a rectangle. We prove that the strict-orthogonal drawability problem for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2014
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2013.08.005